Optimization of Buffer Networks via DC Programming

نویسندگان

چکیده

This brief is concerned with the $H^{2}$ and notation="LaTeX">$H^{\infty }$ norm-constrained optimization problems of dynamic buffer networks. The extended network model introduced first, wherein weights all edges can be tuned independently. Because emerging nonconvexity model, previous results positive linear systems failed to address this situation. By resorting log–log convexity a class nonlinear functions called posynomials, reduced differential convex programming problems. proposed framework illustrated for large-scale

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Optimization of DC-DC Converters via Geometric Programming

The paper presents a new methodology for optimizing the design of DC-DC converters. The magnitudes that we take into account are efficiency, ripples, bandwidth, and RHP zero placement. We apply a geometric programming approach, because the variables are positives and the constraints can be expressed in a posynomial form. This approach has all the advantages of convex optimization. We apply the ...

متن کامل

Phylogenetic Analysis via Dc Programming

The evolutionary history of species may be described by a phylogenetic tree whose topology captures ancestral relationships among the species, and whose branch lengths denote evolution times. For a fixed topology and an assumed probabilistic model of nucleotide substitution, we show that the likelihood of a given tree is a d.c. (difference of convex) function of the branch lengths, hence maximu...

متن کامل

Inferring Channel Buffer Bounds Via Linear Programming

We present a static analysis for inferring the maximum amount of buffer space used by a program consisting of concurrently running processes communicating via buffered channels. We reduce the problem to linear programming by casting the analysis as a fractional capability calculus system. Our analysis can reason about buffers used by multiple processes concurrently, and runs in time polynomial ...

متن کامل

Dynamic Programming via Convex Optimization

It has long been known that a wide class of problems in optimal control can be stated as infinite-dimensional convex optimization problems, where the Bellman equation is relaxed to inequality. In this paper we continue our recent efforts to show how this formulation can be used for numerical computation of optimal cost functions and control laws. In particular, we discuss new forms of discretiz...

متن کامل

Optimization via Parameter Mapping with Genetic Programming

This paper describes a new approach for parameter optimization that uses a novel representation for the parameters to be optimized. By using genetic programming, the new method evolves functions that transform initial random values for the parameters into optimal ones. This new representation allows the incorporation of knowledge about the problem being solved to improve the search. Moreover, t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: IEEE Transactions on Circuits and Systems Ii-express Briefs

سال: 2023

ISSN: ['1549-7747', '1558-3791']

DOI: https://doi.org/10.1109/tcsii.2022.3212693